Job shop scheduling - PDFSEARCH.IO - Document Search Engine

Job shop scheduling
Results: 143

#	Item
121	LNCS[removed]Dual Techniques for Scheduling on a Machine with Varying Speed Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-07-12 04:32:05 Mathematics Mathematical optimization Approximation algorithms Complexity classes Planning Job shop scheduling Polynomial-time approximation scheme Scheduling Dynamic programming Operations research Applied mathematics Theoretical computer science
122	A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio Elisabeth G¨ unther∗† Olaf Maurer∗† Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:18:02 Operations research Analysis of algorithms Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Linear programming Scheduling Online algorithm Theoretical computer science Applied mathematics Computational complexity theory
123	PDF Document Add to Reading List Source URL: media.wiley.com Language: English - Date: 2009-05-22 05:05:20 Mathematical optimization Scheduling Business Technology Job shop scheduling Genetic algorithm scheduling Nurse scheduling problem Operations research Planning Scheduling algorithms
124	Chapter 2: Greedy Algorithms and Local Search (cp. Williamson & Shmoys, Chapter 2) 16 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 NP-complete problems Operations research Mathematical optimization Complexity classes Travelling salesman problem Job shop scheduling Dominating set Greedy algorithm Algorithm Theoretical computer science Computational complexity theory Applied mathematics
125	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
126	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Mathematical optimization Job shop scheduling Operations research Structural complexity theory Metric k-center Algorithm Dominating set NP Theoretical computer science Computational complexity theory Mathematics
127	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Operations research Complexity classes Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Knapsack problem Optimization problem Dynamic programming Theoretical computer science Computational complexity theory Applied mathematics
128	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
129	A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m Add to Reading List Source URL: page.math.tu-berlin.de Language: English Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics
130	Ch 7 Approximation algorithms, online algorithms Bertrand Russell[removed]): Although this may seem a paradox, all exact science is dominated by the idea of approximation. 7.1 Minimum spanning tree approximation to the Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-04-08 10:39:43 NP-complete problems Operations research Spanning tree Travelling salesman problem Vertex cover Job shop scheduling Minimum spanning tree Matching Approximation algorithm Theoretical computer science Mathematics Computational complexity theory

UPDATE